Transferring <i>TTP</i>-structures via contraction
نویسندگان
چکیده
منابع مشابه
Transferring Algebra Structures Up to Homology Equivalence
Given a strong deformation retract M of an algebra A, there are several apparently distinct ways ([9],[19], [13], [24],[15], [18], [17]) of constructing a coderivation on the tensor coalgebra of M in such a way that the resulting complex is quasi isomorphic to the classical (differential tor) [7] bar construction of A. We show that these methods are equivalent and are determined combinatorially...
متن کاملKnowledge Transferring Via Implicit Link Analysis
In this paper, we design a local classification algorithm using implicit link analysis, considering the situation that the labeled and unlabeled data are drawn from two different albeit related domains. In contrast to many global classifiers, e.g. Support Vector Machines, our local classifier only takes into account the neighborhood information around unlabeled data points, and is hardly based ...
متن کاملMerging Ontologies via Kernel Contraction
Ontologies have been largely used to represent terminological knowledge, specially with the advent of the Semantic Web. As knowledge is not static, it is crucial to learn how to deal with ontology dynamics, which includes Ontology Merging and Debugging. Basically, we want to deal with the inconsistencies and incoherences that may occur when a knowledge base receives a new information or when tw...
متن کاملContraction groups and linear dilatation structures
A dilatation structure on a metric space, introduced in [3], is a notion in between a group and a differential structure, accounting for the approximate self-similarity of the metric space. The basic objects of a dilatation structure are dilatations (or contractions). The axioms of a dilatation structure set the rules of interaction between different dilatations. A metric space (X, d) which adm...
متن کاملTransferring Agent Behaviors from Videos via Motion GANs
A major bottleneck for developing general reinforcement learning agents is determining rewards that will yield desirable behaviors under various circumstances. We introduce a general mechanism for automatically specifying meaningful behaviors from raw pixels. In particular, we train a generative adversarial network to produce short sub-goals represented through motion templates. We demonstrate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Homology, Homotopy and Applications
سال: 2005
ISSN: 1532-0073,1532-0081
DOI: 10.4310/hha.2005.v7.n2.a2